package com.tys.algorithm.advanced.code.class16;

import java.util.ArrayList;

// 点结构的描述
public class Node {
    public int value; //值
    public int in; //入度：多少边指向自己
    public int out; //出度：多少边指向别人
    public ArrayList<Node> nexts; //邻居点的集合：出度的
    public ArrayList<Edge> edges; //直接边的集合：出度的

    public Node(int value) {
        this.value = value;
        in = 0;
        out = 0;
        nexts = new ArrayList<>();
        edges = new ArrayList<>();
    }
}
